Robust output feedback NMPC with guaranteed constraint satisfaction
نویسندگان
چکیده
منابع مشابه
Offset-free Nmpc with Robust Constraint Satisfaction Using Model-error Modeling
Robustness and offset-free tracking remains a challenge in the field of nonlinear model predictive control (NMPC) in the presence of plant-model mismatch. This paper focuses on offset-free tracking with robust constraint satisfaction using NMPC. In the proposed approach, the discrepancy between the plant and a fundamental model is captured using a model-error model. The fundamental model is aug...
متن کاملRobust Multi-Objective Feedback Design with Linear Guaranteed-Cost Bounds
This paper considers the problem of designing a state feedback control law which minimizes multiple quadratic performance objectives in the presence of uncertain linear plant dynamics Vec tor optimization techniques are used to minimize upper bounds on each performance objective guaranteed cost By exploiting the linear uncertainty bound introduced by Bernstein the vector optimization problem is...
متن کاملHybrid Output-feedback Guaranteed Cost H∞ Robust Control for Linear Systems
This paper focuses on the hybrid output-feedback guaranteed cost H∞ robust control problem for a class of uncertain linear systems. Time-varying uncertainties are contained in both the state matrix and input matrix. Suppose there exist a finite number of candidate controllers with known controller gain matrices and none of the controllers can solve the guaranteed cost H∞ robust control problem....
متن کاملRobust decentralized static output feedback *
Sufficient conditions are developed for characterizing robust decentralized static output feedback controllers. The approach involves deriving necessary conditions for minimizing a bound on closed-loop performance over a specified range of uncertain parameters. The effect of plant parameter variations on the closed-loop covariance is overbounded by means of a modified Lyapunov equation whose so...
متن کاملSatisfaction Guaranteed
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially useful in an interactive context in which different users access the model to make choices on-line, e.g. in e-commerce configuration. The conventional machinery for ensuring backtrack-free search, however, adds additional...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2015
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2015.09.478